|
| 1: |
|
a__terms(N) |
→ cons(recip(a__sqr(mark(N))),terms(s(N))) |
| 2: |
|
a__sqr(0) |
→ 0 |
| 3: |
|
a__sqr(s(X)) |
→ s(add(sqr(X),dbl(X))) |
| 4: |
|
a__dbl(0) |
→ 0 |
| 5: |
|
a__dbl(s(X)) |
→ s(s(dbl(X))) |
| 6: |
|
a__add(0,X) |
→ mark(X) |
| 7: |
|
a__add(s(X),Y) |
→ s(add(X,Y)) |
| 8: |
|
a__first(0,X) |
→ nil |
| 9: |
|
a__first(s(X),cons(Y,Z)) |
→ cons(mark(Y),first(X,Z)) |
| 10: |
|
mark(terms(X)) |
→ a__terms(mark(X)) |
| 11: |
|
mark(sqr(X)) |
→ a__sqr(mark(X)) |
| 12: |
|
mark(add(X1,X2)) |
→ a__add(mark(X1),mark(X2)) |
| 13: |
|
mark(dbl(X)) |
→ a__dbl(mark(X)) |
| 14: |
|
mark(first(X1,X2)) |
→ a__first(mark(X1),mark(X2)) |
| 15: |
|
mark(cons(X1,X2)) |
→ cons(mark(X1),X2) |
| 16: |
|
mark(recip(X)) |
→ recip(mark(X)) |
| 17: |
|
mark(s(X)) |
→ s(X) |
| 18: |
|
mark(0) |
→ 0 |
| 19: |
|
mark(nil) |
→ nil |
| 20: |
|
a__terms(X) |
→ terms(X) |
| 21: |
|
a__sqr(X) |
→ sqr(X) |
| 22: |
|
a__add(X1,X2) |
→ add(X1,X2) |
| 23: |
|
a__dbl(X) |
→ dbl(X) |
| 24: |
|
a__first(X1,X2) |
→ first(X1,X2) |
|
There are 18 dependency pairs: